Subjective Equilibria in Interactive POMDPs: Theory and Computational Limitations
نویسنده
چکیده
We analyze the asymptotic behavior of agents engaged in a infinite horizon partially observable stochastic game formalized by the interactive POMDP framework. We show that when agents’ initial beliefs satisfy a truth compatibility condition, their behavior converges to a subjective 2-equilibrium in a finite time, and subjective equilibrium in the limit. Imposing an additional assumption of mutual singularity on agents’ initial beliefs makes their behavior converge to Nash equilibrium. While theoretically sound, the equilibrating process is difficult to demonstrate computationally because of the difficulty in coming up with initial beliefs that satisfy the truth compatibility condition.
منابع مشابه
On the Difficulty of Achieving Equilibrium in Interactive POMDPs
We analyze the asymptotic behavior of agents engaged in an infinite horizon partially observable stochastic game as formalized by the interactive POMDP framework. We show that when agents’ initial beliefs satisfy a truth compatibility condition, their behavior converges to a subjective ǫ-equilibrium in a finite time, and subjective equilibrium in the limit. This result is a generalization of a ...
متن کاملComputational Study on the Energetic and Electronic Aspects of Tautomeric Equilibria in 5-methylthio-1,2,4-triazole
The main purpose of this research is to investigate computationally the tautomeric reaction pathway of 5-methyl-3-methylthio-1,2,4-triazole from the thermodynamical and mechanistical viewpoints. In this respect, density functional theory (DFT) in conjunction with the quantum theory of atoms in molecule (QTAIM) has been employed to model the energetic and electronic features of tautomeric mechan...
متن کاملA Particle Filtering Algorithm for Interactive POMDPs
Interactive POMDP (I-POMDP) is a stochastic optimization framework for sequential planning in multiagent settings. It represents a direct generalization of POMDPs to multiagent cases. Expectedly, I-POMDPs also suffer from a high computational complexity, thereby motivating approximation schemes. In this paper, we propose using a particle filtering algorithm for approximating the I-POMDP belief ...
متن کاملAnytime Point Based Approximations for Interactive POMDPs
Partially observable Markov decision processes (POMDPs) have been largely accepted as a rich-framework for planning and control problems. In settings where multiple agents interact POMDPs prove to be inadequate. The interactive partially observable Markov decision process (I-POMDP) is a new paradigm that extends POMDPs to multiagent settings. The added complexity of this model due to the modeli...
متن کاملA Framework for Optimal Sequential Planning in Multiagent Settings
Introduction Research in autonomous agent planning is gradually moving from single-agent environments to those populated by multiple agents. In single-agent sequential environments, partially observable Markov decision processes (POMDPs) provide a principled approach for planning under uncertainty. They improve on classical planning by not only modeling the inherent non-determinism of the probl...
متن کامل